Valuation Constellations

Protein Constellations

In this project, I applied several well-known ideas developed in the computer vision field to problems in protein structure matching. Shape indexing and generalized Hough transforms are classical ideas and have been applied to protein structure matching before (eg, [1, 11, 14]). However, I am using a different representation of protein shape and different matching criteria, which yield results ...

Tcp via Satellite Constellations

Many Transmission Control Protocol (TCP) versions have been proposed for terrestrial wired networks over the Internet Protocol (IP), e.g. Tahoe and Reno. TCP/IP is being studied to overcome its limitations within the satellite medium and to allow its efficient use in hybrid terrestrial/satellite networks. So far studies have been mainly directed to the use of Geostationary Earth Orbit (GEO) con...

Pseudo-almost valuation rings

The aim of this paper is to generalize the‎‎notion of pseudo-almost valuation domains to arbitrary‎ ‎commutative rings‎. ‎It is shown that the classes of chained rings‎ ‎and pseudo-valuation rings are properly contained in the class of‎ ‎pseudo-almost valuation rings; also the class of pseudo-almost‎ ‎valuation rings is properly contained in the class of quasi-local‎ ‎rings with linearly ordere...

Enumeration of planar constellations

The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n > 1, m > 2, and let 0 be a permutation of Sn having di cycles of length i, for i > 1. We prove that the number of m-tuples (1 ; : : : ; m) of permutations of Sn such that: A one-to-one correspondence relates these m-tuples to some rooted planar maps, which ...

Another Enumeration of Constellations